The Node-Deletion Problem for Hereditary Properties is NP-Complete
نویسندگان
چکیده
We consider the family of graph problems called node-deletion problems, defined as follows: For a fixed graph property l7, what is the minimum number of nodes which must be deleted from a given graph so that the resulting subgraph satisfies l7? We show that if l7 is nontrivial and hereditary on induced subgraphs, then the node-deletion problem for n is NP-complete for both undirected and directed graphs.
منابع مشابه
A Uni ed Local Ratio Approximation of Node { Deletion Problems ( Extended
In this paper we consider a uni ed approximation method for node{deletion problems with nontrivial and hereditary graph properties. It was proved 16 years ago that every node{deletion problems for a nontrivial hereditary property is NP{complete via a few generic approximation preserving reductions from the Vertex Cover problem. An open problem posed at that time is concerned with the other dire...
متن کاملApproximation Algorithms for Submodular Set Cover with Applications
The main problem considered is submodular set cover, the problem of minimizing a linear function under a nondecreasing submodular constraint, which generalizes both wellknown set cover and minimum matroid base problems. The problem is NP-hard, and two natural greedy heuristics are introduced along with analysis of their performance. As applications of these heuristics we consider various specia...
متن کاملApproximating Clique and Biclique Problems
We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...
متن کاملMitigating Node Capture Attack in Random Key Distribution Schemes through Key Deletion
Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...
متن کاملA Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties
This paper is concerned with the polynomial time approximability of node{deletion problems for hereditary properties. We will focus on such graph properties that are derived from matroids de nable on the edge set of any graph. It will be shown rst that all the node{deletion problem for such properties can be uniformly formulated by a simple but non{standard form of the integer program. A primal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 20 شماره
صفحات -
تاریخ انتشار 1980